Nearly optimal FIFO buffer management for two packet classes q
نویسندگان
چکیده
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bound, and to the FIFO order of sent packets. We consider push-out buffers, where the algorithm may eject packets from anywhere in the buffer. The best lower bound on the competitive ratio of on-line algorithms for buffer management is approximately 1.28. In this paper we present an on-line algorithm whose competitive ratio is approximately 1.30 for the worst case a. The best previous general upper bound was about 1.888. 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
Nearly optimal FIFO buffer management for two packet classes
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
متن کاملA Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes
We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity B. At any time, the buffer cannot accommodatemore than B packets. Packets arrive over time. Each packet has a nonnegative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the bufferwill not ...
متن کاملDelay Differentiation without Rate Tinkering
Link buffering is a key element in packet-switched networks to absorb temporary traffic bursts without excessive dropping. The resulting queuing delay is a critical performance factor. Research on buffer management typically studies differentiated buffer allocation to control forwarding rates or buffer size management to control the overall queuing delay. On the other hand, delay differentiatio...
متن کاملDRA: a new buffer management scheme for wireless atm networks using aggregative large deviation principle
In this paper, we present a buffer management scheme called Dynamic Resource Allocation (DRA) that provides TCP traffic control guarantees to VCs carrying multiple dynamic discard thresholds (Multiple Dynamic Thresholds—MDT) over a wireless CDMA ATM network. It is assumed that we have TCP wireless ATM networks integrating the Code Division Multiple Access (CDMA). A major task activity related t...
متن کاملTraffic-Driven Implicit Buffer Management (Extended Version)
Different network applications have different service preferences regarding packet delay and buffering. Delay management requires scheduling support at routers, which traditionally also requires some form of traffic specification and admission control. In contrast, this paper studies the problem of guaranteeing queueing delay bounds for multiple service classes without traffic contracts and wit...
متن کامل